Random Demand Satisfaction in Unreliable Production–Inventory–Customer Systems
نویسندگان
چکیده
منابع مشابه
Random Demand Satisfaction in Unreliable Production-Inventory-Customer Systems
A method for calculating the probability of customer demand satisfaction in production– inventory–customer systems with Markovian machines, finite finished goods buffers, and random demand is developed. Using this method, the degradation of this probability as a function of demand variability is quantified. In addition, it is shown by examples that the probability of customer demand satisfactio...
متن کاملDiscounting Strategy in Two-Echelon Supply Chain with Random Demand and Random Yield
T This paper analyzes different pricing strategies in a two-echelon supply chain including one supplier and two retailers. The supplier and the retailers face random yield and random demand, respectively. Moreover, coordination or non-coordination of retailers in receiving the discount is investigated. Game theory is used to model and analyze the problems. The supplier as a leader of Stackelbe...
متن کاملInventory Systems with Advance Demand Information and Random Replenishment Times
Advance demand information, when used effectively, improves the performance of production/inventory systems. The extent of improvement however depends on certain factors. We investigate the influence of random supply lead times on a single-stage inventory system with advance demand information. It is found that the supply lead time variability diminishes the benefits of advance demand information.
متن کاملRandom Constraint Satisfaction Problems
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r = m/n where solutions are known to exist with probability close to one due to non-constructive arguments. However, no algorithms are known to find solutions efficiently with a non-vanishing probability at e...
متن کاملk-Connectivity in Random Key Graphs With Unreliable Links
Random key graphs form a class of random intersec-tion graphs and are naturally induced by the random key predis-tribution scheme of Eschenauer and Gligor for securing wirelesssensor network (WSN) communications. Random key graphshave received much interest recently, owing in part to theirwide applicability in various domains including recommendersystems, social networks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2004
ISSN: 0254-5330
DOI: 10.1023/b:anor.0000012279.78938.6b